On cyclically orientable graphs
نویسندگان
چکیده
منابع مشابه
On cyclically orientable graphs
Graph G is called cyclically orientable (CO) if it admits an orientation in which every simple chordless cycle is cyclically oriented. This family of graphs was introduced by Barot, Geiss, and Zelevinsky in their paper “Cluster algebras of finite type and positive symmetrizable matrices”, J. London Math. Soc. 73 Part 3 (2006), 545-564. The authors obtained several nice characterizations of CO-g...
متن کاملCyclically Orientable Graphs
Barot, Geiss and Zelevinsky define a notion of a “cyclically orientable graph” and use it to devise a test for whether a cluster algebra is of finite type. Barot, Geiss and Zelivinsky’s work leaves open the question of giving an efficient characterization of cyclically orientable graphs. In this paper, we give a simple recursive description of cyclically orientable graphs, and use this to give ...
متن کاملPolynomial enumeration of chordless cycles on cyclically orientable graphs
In a finite undirected simple graph, a chordless cycle is an induced subgraph which is a cycle. A graph is called cyclically orientable if it admits an orientation in which every chordless cycle is cyclically oriented. We propose an algorithm to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithm have the advantage of finding each chordle...
متن کاملOn cyclically embeddable graphs
An embedding of a simple graph G into its complement G is a permutation σ on V (G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider some families of embeddable graphs such that the corresponding permutation is cyclic.
متن کاملOn cyclically embeddable (n, n-1)-graphs
An embedding of a simple graph G into its complement G is a permutation σ on V (G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider the embeddable (n, n)-graphs. We prove that with few exceptions the corresponding permutation may be chosen as cyclic one.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.03.055